A Decidable Extension of SRIQ with Disjunctions in Complex Role Inclusion Axioms
نویسندگان
چکیده
This paper establishes the decidability of SR⊔IQ which has composition-based role Inclusion axioms (RIAs) of the form R1 ◦ · · · ◦ Rn⊑̇T1 ⊔ · · · ⊔ Tm. Also the consistency of an Abox A of SR⊔IQ DL w.r.t. Rbox R is established. Motivation for this kind of RIAs comes from applications in the field of manufactured products as well as other conceptual modeling applications such as family relationships. The solution is based on a tableau algorithm.
منابع مشابه
The Irresistible SRIQ
Motivated primarily by medical terminology applications, the prominent DL SHIQ has already been extended to a DL with complex role inclusion axioms of the form R ◦ S v̇ R or S ◦ R v̇ R, called RIQ, and the SHIQ tableau algorithm has been extended to handle such inclusions. This paper further extends RIQ and its tableau algorithm with important expressive means that are frequently requested in ont...
متن کاملA Decidable Extension of SROIQ with Complex Role Chains and Unions
We design a decidable extension of the description logic SROIQ underlying the Web Ontology Language OWL2. The new logic, called SROIQ, supports a controlled use of role axioms whose right-hand side may contain role chains or role unions. We give a tableau algorithm for checking concept satisfiability with respect to SROIQ ontologies and prove its soundness, completeness and termination.
متن کاملA Tableaux-based Algorithm for Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
In this paper, we investigate an extension of the description logic SHIQ––a knowledge representation formalism used for the Semantic Web––with transitive closure of roles occurring not only in concept inclusion axioms but also in role inclusion axioms. We start by proving that adding transitive closure of roles to SHIQ without restriction on role hierarchies may lead to undecidability. An analy...
متن کاملSRIQ and SROIQ are Harder than SHOIQ
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR—a fragment of SROIQ without nominals, number restrictions, and inverse roles—is 2ExpTime-hard. 1 From SHIQ to SROIQ In this paper we study the complexity of reasoning in the DL SROIQ—the logic chosen as a candidate for OWL 2. SROIQ has been in...
متن کاملAn Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ
We propose an extension of the syntactic restriction for complex role inclusion axioms in the description logic SROIQ. Like the original restriction in SROIQ, our restrictions can be checked in polynomial time and they guarantee regularity for the sets of role chains implying roles, and thereby decidability for the main reasoning problems. But unlike the original restrictions, our syntactic res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012